Fundamental Results of Cyclic Codes over Octonion Integers and Their Decoding Algorithm
نویسندگان
چکیده
Coding theory is the study of properties codes and their respective fitness for specific applications. Codes are used data compression, cryptography, error detection, correction, transmission, storage. studied by various scientific disciplines, such as information theory, electrical engineering, mathematics, linguistics, computer science, to design efficient reliable transmission methods. Many authors in previous literature have discussed over finite fields, Gaussian integers, quaternion etc. In this article, author defines octonion fundamental theorems related encoding, decoding cyclic residue class integers with respect Mannheim weight one. The comparison primes, lengths, cardinality, dimension, code rate Quaternion Integers Octonion will be discussed.
منابع مشابه
Codes over a subset of Octonion Integers
In this paper we define codes over some Octonion integers. We prove that in some conditions these codes can correct up to two errors for a transmitted vector and the code rate of the codes is grater than the code rate of the codes defined on some subset of Quaternion integers.
متن کاملCYCLIC CODES AND THEIR DUALS OVER Zm
In this paper we study the cyclic codes over Zm as being Zm-submodules of ZmG and we find their minimal generating sets. We also study the dual codes of cyclic codes and find their generators as being ideals in ZmG. Throughout this paper, we assume m = q, q is a prime number and (n, q) = 1.
متن کاملCodes over Hurwitz integers
In this study, we obtain new classes of linear codes over Hurwitz integers equipped with a new metric. We refer to the metric as Hurwitz metric. The codes with respect to Hurwitz metric use in coded modulation schemes based on quadrature amplitude modulation (QAM)-type constellations, for which neither Hamming metric nor Lee metric. Also, we define decoding algorithms for these codes when up to...
متن کاملDecoding of Cyclic Codes over F 2 + Uf 2
1 Abstract We give a simple decoding algorithm to decode linear cyclic codes of odd length over the ring R = F2 + uF2 = f0; 1; u; u = u + 1g, where u 2 = 0. A spectral representation of the cyclic codes over R is given and a BCH like bound is given for the Lee distance of the codes. The ring R shares many properties of Z4 and F4 and admits a linear \Gray map". 1 0 1 u u u 0 u 1 u u 0 u u 0 + 0 ...
متن کاملDecoding Cyclic Codes Over Zq Beyond The BCH Bound
We present an efficient algorithm for computing a monic characteristic polynomial of a set of M finite R-sequences where R = GR(q, a), the a-dimensional Galois extension ring of Zq and apply it to the decoding of cyclic codes over Zq up to the Hartmann-Tzeng bound where multiple syndromes are available. Characterization of the set of characteristic polynomials of the M syndromes (interpreted as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computation (Basel)
سال: 2022
ISSN: ['2079-3197']
DOI: https://doi.org/10.3390/computation10120219